A P-MINIMAL STRUCTURE WITHOUT DEFINABLE SKOLEM FUNCTIONS
نویسندگان
چکیده
منابع مشابه
On Definable Skolem Functions in Weakly O-Minimal nonvaluational Structures
We prove that all known examples of weakly o-minimal non-valuational structures have no de nable Skolem functions. We show, however, that such structures eliminate imaginaries up to de nable families of cuts. Along the way we give some new examples of weakly ominimal non-valuational structures.
متن کاملExtension of P-adic Definable Lipschitz Functions
Write OK for the valuation ting, MK for the maximal ideal of K and kK for the residue field. Let us fix $ some uniformizer of K. We denote by acm : K → OK/(MK) the map sending some nonzero x ∈ K to x$−ord(x) mod MK , and sending zero to zero. This is a definable map. We denote by RV the union of K×/(1 +MK) and {0} and by rv : K → RV the quotient map. More generally, if m ∈ N∗, we set RVm = K×/(...
متن کاملDefinable functions continuous on curves in o-minimal structures
We give necessary and sufficient conditions on a non-oscillatory curve in an o-minimal structure such that, for any bounded definable function, there exists a definable closed set containing an initial segment of the curve on which the function is continuous. This question is translated into one on types: What are the conditions on an n-type such that, for any bounded definable function, there ...
متن کاملOn gradients of functions definable in o-minimal structures
© Annales de l’institut Fourier, 1998, tous droits réservés. L’accès aux archives de la revue « Annales de l’institut Fourier » (http://annalif.ujf-grenoble.fr/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier...
متن کاملBifurcation Sets of Definable Functions in O-minimal Structures
In this work we answer a question stated by Loi and Zaharia concerning trivialization of definable functions off the bifurcation set: we prove that definable functions are trivial off the bifurcation set, and the trivialization can be chosen definable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2017
ISSN: 0022-4812,1943-5886
DOI: 10.1017/jsl.2016.58